Parameterized computational complexity of finding small-diameter subgraphs
نویسندگان
چکیده
منابع مشابه
Parameterized computational complexity of finding small-diameter subgraphs
Finding subgraphs of small diameter in undirected graphs has been seemingly unexplored from a parameterized complexity perspective. We perform the first parameterized complexity study on the corresponding NP-hard s-Club problem. We consider two parameters: the solution size and its dual.
متن کاملParameterized complexity of finding small degree-constrained subgraphs
In this article we study the parameterized complexity of problems consisting in finding degree-constrained subgraphs, taking as the parameter the number of vertices of the desired subgraph. Namely, given two positive integers d and k, we study the problem of finding a d-regular (induced or not) subgraph with at most k vertices and the problem of finding a subgraph with at most k vertices and of...
متن کاملParameterized Complexity of Finding Regular Induced Subgraphs
The r-Regular Induced Subgraph problem asks, given a graph G and a non-negative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced subgraph in which every vertex has degree exactly r. In this paper we examine its parameterization k-Size r-Regular Induced Subgraph with k as parameter and prove that it is W [1]-hard. We also examine the parameteriz...
متن کاملParameterized Complexity of Finding Subgraphs with Hereditary Properties
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial hereditary property Π , are there k vertices of G that induce a subgraph with property Π? This problem has been proved NP-hard by Lewis and Yannakakis[9]. We show that if Π includes all independent sets but not all c...
متن کاملParameterized Complexity of Diameter
Diameter—the task of computing the length of a longest shortest path—is a fundamental graph problem. Assuming the Strong Exponential Time Hypothesis, there is no O(n)time algorithm even in sparse graphs [Roditty and Williams, 2013]. To circumvent this lower bound we aim for algorithms with running time f(k)(n+m) where k is a parameter and f is a function as small as possible. For our choices of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2011
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-011-0311-5